Symbolic Probabilistic Inference with Continuous Variables
نویسندگان
چکیده
Research on Symbolic Probabilistic Inference (SPI) [2, 3) has provided an algorithm for re solving general queries in Bayesian networks. SPI applies the concept of dependency directed backward search to probabilistic in ference, and is incremental with respect to both queries and observations. Unlike tra ditional Bayesian network inferencing algo rithms, SPI algorithm is goal directed, per forming only those calculations that are re quired to respond to queries. Research to date on SPI applies to Bayesian networks with discrete-valued variables and does not address variables with continuous values. In this paper1, we extend the SPI algorithm to handle Bayesian networks made up of continuous variables where the relationships between the variables are restricted to be "linear gaussian". We call this variation of the SPI algorithm, SPI Continuous (SPIC). SPIC modifies the three basic SPI opera tions: multiplication, summation, and sub stitution. However, SPIC retains the frame work of the SPI algorithm, namely building the search tree and recursive query mecha nism and therefore retains the goal-directed and incrementality features of SPI.
منابع مشابه
Inference in probabilistic logic programs with continuous random variables
Probabilistic Logic Programming (PLP), exemplified by Sato and Kameya’s PRISM, Poole’s ICL, Raedt et al’s ProbLog and Vennekens et al’s LPAD, is aimed at combining statistical and logical knowledge representation and inference. However, the inference techniques used in these works rely on enumerating sets of explanations for a query answer. Consequently, these languages permit very limited use ...
متن کاملPSI: Exact Symbolic Inference for Probabilistic Programs
Probabilistic inference is a key mechanism for reasoning about probabilistic programs. Since exact inference is theoretically expensive, most probabilistic inference systems today have adopted approximate inference techniques, which trade precision for better performance (but often without guarantees). As a result, while desirable for its ultimate precision, the practical effectiveness of exact...
متن کاملInference and Learning in Probabilistic Logic Programs with Continuous Random Variables
of the Dissertation Inference and Learning in Probabilistic Logic Programs with Continuous Random Variables
متن کاملA New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملParameter Learning in PRISM Programs with Continuous Random Variables
Probabilistic Logic Programming (PLP), exemplified by Sato and Kameya’s PRISM, Poole’s ICL, De Raedt et al’s ProbLog and Vennekens et al’s LPAD, combines statistical and logical knowledge representation and inference. Inference in these languages is based on enumerative construction of proofs over logic programs. Consequently, these languages permit very limited use of random variables with con...
متن کامل